Complex metaheuristics
نویسندگان
چکیده
Complexity is a prevalent feature of numerous natural and artificial systems and as such has attracted much scientific interest in the last decades. The pursuit of computational tools capable of analyzing, modeling or designing systems exhibiting this complex nature –in which the properties of the system are not evident at the bottom level but emerge from its global structure– is a major issue. Metaheuristics can play here an important role due to its intrinsic adaptability and powerful optimization capabilities. In many regards, metaheuristics are also examples of complex systems since their behavior emanates from the orchestrated interplay of simpler algorithmic components. This bidirectional connection between metaheuristics and complex systems offers numerous avenues for fruitful research.
منابع مشابه
Metaheuristics: A Canadian Perspective
Metaheuristics are generic search strategies that can be adapted to solve complex problems. This paper describes in simple terms the most popular metaheuristics for combinatorial optimization problems. It also emphasizes the main contributions of the Canadian research community in the development and application of metaheuristics.
متن کاملEmploying Learning to Improve the Performance of Meta-RaPS
In their search for satisfactory solutions to complex combinatorial problems, metaheuristics methods are expected to intelligently explore the solution space. Various forms of memory have been used to achieve this goal and improve the performance of metaheuristics, which warranted the development of the Adaptive Memory Programming (AMP) framework [1]. This paper follows this framework by integr...
متن کاملOptimization of Complex Systems with OptQuest
⎯ Optimization of complex systems has been for many years limited to problems that could be formulated as mathematical programming models of linear, nonlinear and integer types. Problemspecific heuristics that do not require a mathematical formulation of the problem have been also used for optimizing complex systems, however, they generally must be developed in a case-by-case basis. Recent rese...
متن کاملInstance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem
Metaheuristics are known to be strong in solving large-scale instances of computationally hard problems. However, their efficiency still needs exploration in the context of instance structure, scale and numerical properties for many of these problems. In this paper, we present an in-depth computational study of two local search metaheuristics for the classical uncapacitated facility location pr...
متن کاملResearch Report: GPU-based Approaches for Hybrid Metaheuristics
In combinatorial optimization, near-optimal algorithms such as metaheuristics allow to iteratively solve in a reasonable time NP-hard complex problems. Two main categories of metaheuristics are distinguished: population-based metaheuristics (P-metaheuristics) and solution-based metaheuristics (S-metaheuristics). P-metaheuristics are population-oriented as they manage a whole population of solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Science
دوره 17 شماره
صفحات -
تاریخ انتشار 2016